Iterative Re nement for Linear Systemsand
نویسندگان
چکیده
The technique of iterative reenement for improving the computed solution to a linear system was used on desk calculators and computers in the 1940s and has remained popular. In the 1990s iterative reenement is well supported in software libraries, notably in LAPACK. Although the behaviour of iterative reenement in oating point arithmetic is reasonably well understood, the existing theory is not suucient to justify the use of xed precision iterative reenement in all the LAPACK routines in which it is implemented. We present analysis that provides the theoretical support needed for LAPACK. The analysis covers both mixed and xed precision iterative reenement with an arbitrary number of iterations, makes only a general assumption on the underlying solver, and is relatively short. We identify some remaining open problems.
منابع مشابه
Iterative Re nement and LAPACKN
The technique of iterative reenement for improving the computed solution to a linear system was used on desk calculators and computers in the 1940s and has remained popular. In the 1990s iterative reenement is well supported in software libraries, notably in LAPACK. Although the behaviour of iterative re-nement in oating point arithmetic is reasonably well understood, the existing theory is not...
متن کاملEditionLocal convergence of the ( exact and inexact ) iterative aggregation method for linear systemsand Markov
The iterative aggregation method for the solution of linear systems is extended in several directions: to operators on Banach spaces; to the method with inexact correction, i.e., to methods where the (inner) linear system is in turn solved iteratively; and to the problem of nding stationary distributions of Markov operators. Local convergence is shown in all cases. Convergence results apply to ...
متن کاملIterative Solution of Elliptic Finite Element Problems on Partially Reened Meshes and the Eeect of Using Inexact Solvers
We will consider some solution methods for the linear systems of algebraic equations which arise from second-order elliptic nite element problems. We rst consider iterative re nement methods. Historically these methods were called FAC and AFAC methods. Optimal bounds of the condition number for the AFAC iterative operator are established by proving a strengthened Cauchy-Schwarz inequality using...
متن کاملArchitecture Re nement
|A method is presented for the stepwise re nement of an abstract architecture into a relatively correct lower-level architecture that is intended to implement it. A re nement step involves the application of a prede ned renement pattern that provides a routine solution to a standard architectural design problem. A pattern contains an abstract architecture schema and a more detailed schema inten...
متن کاملSupports of Locally Linearly Independent M-Refinable Functions, Attractors of Iterated Function Systems and Tilings
We study supports of M -re ̄nable functions by means of attractors of iterated function systems, where M is an integer greater than (or equal to) 2. Most of the time, the re ̄nable function Á is not explicitly known. We need to study their properties from the re ̄nement mask. Under the assumption of local linear independence, we show that the support equals to the attractor of an iterated function...
متن کامل